Some quadratic optimisation problems in psychometrics
نویسنده
چکیده
In this paper, I discuss various examples arising from different areas in psychometrics. I will show that they have a common background and can be solved using a constrained quadratic optimisation algorithm developed by Albers et al. (2008a,b).
منابع مشابه
Polynomial unconstrained binary optimisation – Part 1 Fred Glover
The class of problems known as quadratic zero-one (binary) unconstrained optimisation has provided access to a vast array of combinatorial optimisation problems, allowing them to be expressed within the setting of a single unifying model. A gap exists, however, in addressing polynomial problems of degree greater than 2. To bridge this gap, we provide methods for efficiently executing core searc...
متن کاملPolynomial unconstrained binary optimisation - Part 2
The class of problems known as quadratic zero-one (binary) unconstrained optimisation has provided access to a vast array of combinatorial optimisation problems, allowing them to be expressed within the setting of a single unifying model. A gap exists, however, in addressing polynomial problems of degree greater than 2. To bridge this gap, we provide methods for efficiently executing core searc...
متن کاملFast two-flip move evaluations for binary unconstrained quadratic optimisation problems
We provide a method for efficiently evaluating two-flip moves that simultaneously change the values of two 0–1 variables in search methods for binary unconstrained quadratic optimisation problems (UQP). We extend a framework recently proposed by the authors for creating efficient evaluations of one-flip moves to yield a method requiring significantly less computation time than a direct sequenti...
متن کاملA heuristic solution to the optimisation of flutter control in compression systems (and to some more binary quadratic programming problems) via ΔΣ modulation circuits
An example of how circuit related techniques can help solving optimisatin problems originating from completely different domains is provided. It is shown that a specific class of Unconstrained Binary Quadratic Programming (UBQP) problems, including those arising in the optimisation of flutter control via blade mistuning, can be solved by means of ∆Σ modulators. This is done in steps, first rest...
متن کاملA New Solution for the Cyclic Multiple-Part Type Three-Machine Robotic Cell Problem based on the Particle Swarm Meta-heuristic
In this paper, we develop a new mathematical model for a cyclic multiple-part type threemachine robotic cell problem. In this robotic cell a robot is used for material handling. The objective is finding a part sequence to minimize the cycle time (i.e.; maximize the throughput) with assumption of known robot movement. The developed model is based on Petri nets and provides a new method to calcul...
متن کامل